package base;

import operateurs.Non;
import termes.Terme;
import utils.FormuleType;
/**
 *  Copyright (c) 1999-2011, Ecole des Mines de Nantes
 *  All rights reserved.
 *  Redistribution and use in source and binary forms, with or without
 *  modification, are permitted provided that the following conditions are met:
 *
 *      * Redistributions of source code must retain the above copyright
 *        notice, this list of conditions and the following disclaimer.
 *      * Redistributions in binary form must reproduce the above copyright
 *        notice, this list of conditions and the following disclaimer in the
 *        documentation and/or other materials provided with the distribution.
 *      * Neither the name of the Ecole des Mines de Nantes nor the
 *        names of its contributors may be used to endorse or promote products
 *        derived from this software without specific prior written permission.
 *
 *  THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ANY
 *  EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
 *  WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 *  DISCLAIMED. IN NO EVENT SHALL THE REGENTS AND CONTRIBUTORS BE LIABLE FOR ANY
 *  DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
 *  (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 *  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 *  ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 *  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 *  SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

/**
 * Created by IntelliJ IDEA.
 * User: njussien
 * Date: 30/11/12
 * Time: 10:25
 */
/// ATOME = point d'arret.
public class Atome extends Formule {
    private String nom;
    private int arite;
    private Terme[] operandes;
    
    public Atome(String nom, Terme... operandes) {
    	this.nom = nom;
    	this.operandes = operandes;
    	this.arite = operandes.length;
    };
    
    public String toString(){
    	String tmp = this.nom + "(";
    	
    	if (this.arite > 0) tmp += this.operandes[0];
    	for(int i = 1; i < this.arite; i++){
    		tmp += ", " + this.operandes[i];
    	}
    	
    	return tmp+ ")";
    }

	public Formule supprimeConnecteurs() {
		for (int i = 0; i < operandes.length; i++) {
		}
		return this;
	}

	public Formule negation() {
		return new Non(new Atome(this.nom, this.operandes));
	}
	
	public String getNom() {
		return nom;
	}
	
	public int getArite() {
		return arite;
	}
	
	public Terme[] getOperandes() {
		return operandes;
	}

	public Formule descendreNegation(boolean isNegatif) {
		if(isNegatif)
			return new Non(new Atome(this.nom, this.operandes)); 		
		return new Atome(this.nom, this.operandes);
	}

	public Formule transportQuantificateurs() {
		return new Atome(this.nom, this.operandes);
	}
	
	
	public boolean isSame(Formule o){
		if(o.getClass() != Atome.class) return false;
		Atome tmp = (Atome)o;
		if(this.nom != tmp.getNom()) return false;
		if(this.arite != tmp.getArite()) return false;
		
		Terme tmpTab[] = tmp.getOperandes();
		for(int i = 0; i < this.arite ; i++){
			if(!(this.operandes[i].equals(tmpTab[i]))) return false;
		}
		return true;
	}

	public Formule miseFormeClausale() {
		// TODO
		return new Atome(this.nom, this.operandes);
	}

	public FormuleType getType() {
		return FormuleType.ATOME;
	}

	public boolean isQuantifieursInOrder(boolean aUniversel) {
		return true;
	}

	public boolean isQuantifieursFirsts(boolean nonQuantifeur) {
		return true;
	}
}
